/*
 * JaLingo, http://jalingo.sourceforge.net/
 *
 * Copyright (c) 2002-2006 Oleksandr Shyshko
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package ja.centre.util.io;

public class ByteArray {
    private byte[] bytes = new byte[] {};
    private int length;

    public ByteArray() {
    }
    public ByteArray( byte[] bytes ) {
        this.bytes = bytes;
        this.length = bytes.length;
    }

    public int getLength() {
        return length;
    }
    public void setLength( int length ) {
        this.length = length;

        if ( bytes.length < length ) {
            bytes = new byte[length];
        }
    }

    public byte[] getBytes() {
        return bytes;
    }
    public int get( int i ) {
        return bytes[i];
    }
    public boolean contains( int index, int... subject ) {
        // TODO check upper bound
        for ( int i = 0; i < subject.length; i++ ) {
            if ( bytes[index + i] != subject[i] ) {
                return false;
            }
        }
        return true;
    }
    public boolean startsWith( int... subject ) {
        return contains( 0, subject );
    }
    public boolean endsWith( int... subject ) {
        return contains( getLength() - subject.length, subject );
    }
}
